Epsilon-complexity of continuous functions

نویسندگان

  • Boris S. Darkhovsky
  • Alexandra Pyriatinska
چکیده

A formal definition of ǫ-complexity of an individual continuous function defined on a unit cube is proposed. This definition is consistent with the Kolmogorov’s idea of the complexity of an object. A definition of ǫ-complexity for a class of continuous functions with a given modulus of continuity is also proposed. Additionally, an explicit formula for the ǫ-complexity of a functional class is obtained. As a consequence, the paper finds that the ǫcomplexity for the Hölder class of functions can be characterized by a pair of real numbers. Based on these results the papers formulates a conjecture concerning the ǫ-complexity of an individual function from the Hölder class. We also propose a conjecture about characterization of ǫ-complexity of a function from the Hölder class given on a discrete grid.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Basic Theorem and its Consequences

Let T be a compact Hausdorff topological space and let M denote an n–dimensional subspace of the space C(T ), the space of real–valued continuous functions on T and let the space be equipped with the uniform norm. Zukhovitskii [7] attributes the Basic Theorem to E.Ya.Remez and gives a proof by duality. He also gives a proof due to Shnirel’man, which uses Helly’s Theorem, now the paper obtains a...

متن کامل

An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function

In this paper, an interior-point algorithm  for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...

متن کامل

An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function

In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...

متن کامل

ADAPTIVE FUZZY TRACKING CONTROL FOR A CLASS OF PERTURBED NONLINEARLY PARAMETERIZED SYSTEMS USING MINIMAL LEARNING PARAMETERS ALGORITHM

In this paper, an adaptive fuzzy tracking control approach is proposed for a class of single-inputsingle-output (SISO) nonlinear systems in which the unknown continuous functions may be nonlinearlyparameterized. During the controller design procedure, the fuzzy logic systems (FLS) in Mamdani type are applied to approximate the unknown continuous functions, and then, based on the minimal learnin...

متن کامل

Controlling Nonlinear Processes, using Laguerre Functions Based Adaptive Model Predictive Control (AMPC) Algorithm

Laguerre function has many advantages such as good approximation capability for different systems, low computational complexity and the facility of on-line parameter identification. Therefore, it is widely adopted for complex industrial process control. In this work, Laguerre function based adaptive model predictive control algorithm (AMPC) was implemented to control continuous stirred tank rea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1303.1777  شماره 

صفحات  -

تاریخ انتشار 2013